價格：免費
更新日期：2016-07-29
檔案大小：19M
目前版本：1.0
版本需求：Android 2.3 以上版本
官方網站：http://csharpcoding.org
Email：bestlis2012@gmail.com
聯絡地址：Kyiv
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.
With three disks, the puzzle can be solved in seven moves.
The game supports different modes of disk moving: you can drag and drop them to or move by clicking on the disk and the pyramids.
